Reed-Muller Codes and Incidence Matrices
نویسندگان
چکیده
In this paper, we discuss Reed-Muller codes using a set-theoretic approach. We present a new basis of minimum weight codewords which correspond to subspaces of a fixed dimension of affine geometry over GF (2). A generator matrix in standard form is also given. Index Words: Reed-Muller codes, Basis of minimum weight codewords, Incidence matrix, Standard form MR Subject Classification: 94B05, 05B20
منابع مشابه
Bases of Minimum-Weight Vectors for Codes from Designs
An explicit basis of incidence vectors for the p-ary code of the design of points and hyperplanes of the affine geometry AGm(Fp) for any prime p and any integer m ≥ 2 is obtained, which, as a corollary, gives a new elementary proof that this code is a generalized Reed-Muller code. In the proof a class of non-singular matrices related to Vandermonde matrices is introduced.
متن کاملReed-Muller Codec Simulation Performance
The approach to error correction coding taken by modern digital communication systems started in the late 1940’s with the ground breaking work of Shannon, Hamming and Golay. ReedMuller (RM) codes were an important step beyond the Hamming and Golay codes because they allowed more flexibility in the size of the code word and the number of correctable errors per code word. Whereas the Hamming and ...
متن کاملAn Explicit Construction of Universally Decodable Matrices
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers L and n and a prime power q. Based on Pascal’s triangle we give an explicit construction of universally decodable matrices for any non-zero integers L and n and any prime power q where L ≤ q + 1. This is the largest set of possible par...
متن کاملRemarks on Codes, Spectral Transforms, and Decision Diagrams
In this paper, we discuss definitions, features, and relationships of Reed-Muller transforms, Reed-Muller codes and their generalizations to multiple-valued cases, and Reed-Muller decision diagrams. The novelty in this primarily review paper resides in putting together these concepts in the same context and providing a uniform point of view to their definition in terms of a convolutionwise mult...
متن کاملOn binary codes related to mutually quasi-unbiased weighing matrices
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying the conditions that the number of non-zero weights of the code is four and the code contains the first order Reed–Muller code. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give ...
متن کامل